Computability logic - PDFSEARCH.IO - Document Search Engine

Computability logic
Results: 552

#	Item
151	Errata and Addenda for “On Abstraction and Informatics” [12] Tom Verhoeff October 2011, Augustp.7, below (5) The definition of morphism composition ◦ should read Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2013-08-31 05:46:37 Computability theory Recursion Functions and mappings Lambda calculus Fixed-point combinator Combinatory logic ML Function Iterated function Mathematics Theoretical computer science Software engineering
152	Termination Proofs Ordinal Ranking Length Functions Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2014-09-25 09:59:32 Theoretical computer science Functions and mappings ELEMENTARY Ordinal number Termination analysis Function Mathematics Computability theory Mathematical logic
153	Directions in Functional Programming for Real(-Time) Applications? Walid Taha?? , Paul Hudak, Zhanyong Wan Department of Computer Science, Yale University, New Haven, CT, USA. {taha,hudak,zwan}@cs.yale.edu Add to Reading List Source URL: www.cs.rice.edu Language: English - Date: 2002-02-25 08:31:05 Computability theory Theoretical computer science Models of computation Type theory Logic in computer science Monad Lambda calculus Functional programming Type system Software engineering Computing Computer programming
154	Informatics Everywhere: Information and Computation in Society, Science, and Technology Tom Verhoeff Dept. of Math. and CS, Eindhoven University of Technology Den Dolech 2, 5612 AZ Eindhoven, The Netherlands Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2013-06-24 05:42:44 Computability theory Lambda calculus Models of computation Formal methods Informatics Combinatory logic Computation Information theory Algorithm Applied mathematics Theoretical computer science Mathematics
155	Mart´ın H. Escard´ o. BSc, MSc, PhD Last updated November 14, 2014. See also http://www.cs.bham.ac.uk/ mhe/ I was born in Rio de Janeiro, Brazil. I am married and have three children, born in 1998, 2000 and 2010. Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2014-11-14 10:40:02 Logic in computer science Formal methods Computability theory Models of computation Dana Scott Semantics of programming languages IEEE Symposium on Logic in Computer Science Computer science Mathematical logic Theoretical computer science Mathematics Applied mathematics
156	History of Lambda-calculus and Combinatory Logic J. Roger Hindley † 2006, from Swansea University Mathematics Department Research Report Add to Reading List Source URL: www.users.waitrose.com Language: English - Date: 2008-01-14 18:38:50 Lambda calculus Combinatory logic Computability theory Fixed-point combinator Function Haskell Curry Free variables and bound variables Principia Mathematica First-order logic Mathematics Mathematical logic Theoretical computer science
157	Chapter 4: Computability Algorithmic Adventures From Knowledge to Magic Book by Juraj Hromkoviˇ Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-10-24 15:09:33 Computability theory Mathematical logic Theory of computation Logic in computer science Proof theory Undecidable problem Decision problem Algorithm Computability Theoretical computer science Mathematics Applied mathematics
158	Chapter 2: Algorithmics Quotation Algorithmic Adventures From Knowledge to Magic Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2010-10-12 03:18:13 Theoretical computer science Computer program Mathematics Models of computation Computability theory Computing Algorithm Mathematical logic
159	Pattern Recognition for Coinductive Proof Trees Katya Komendantskaya School of Computing, University of Dundee, UK AI4FM’11,Edinburgh 29 April 2011 Add to Reading List Source URL: www.ai4fm.org Language: English - Date: 2013-10-30 13:20:15 Computer programming Mathematical logic Category theory Functional programming Computability theory Coinduction Recursion Mathematical proof Machine learning Mathematics Logic Theoretical computer science
160	Lecture 4: Is that Really Revising Logic? König’s paradox (and Berry’s variant). Let L be any language whose formulas are finite strings of finitely many basic symbols. Then (K1) Add to Reading List Source URL: www.philosophy.ox.ac.uk Language: English - Date: 2008-05-15 07:08:03 Set theory Berry paradox Constructible universe Ordinal numbers Computability theory Definable real number Proof theory Ordinal definable set Mathematical logic Mathematics Philosophy of mathematics

UPDATE